How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus
نویسندگان
چکیده
We shall describe two general methods for proving lower bounds on the lengths of proofs in propositional calculus and give examples of such lower bounds. One of the methods is based on interactive proofs where one player is claiming that he has a falsifying assignment for a tautology and the second player is trying to convict him of a lie. The second method is based on boolean valuations. For the first method, a log n + log log n − O(log log log n) lower bound is given on the lengths of interactive proofs of certain permutation tautologies.
منابع مشابه
How to lie without being (easily) convicted and the lengths of proofs in propositional calculus
We shall describe two general methods for proving lower bounds on the lengths of proofs in propositional calculus and give examples of such lower bounds. One of the methods is based on interactive proofs where one player is claiming that he has a falsifying assignment for a tautology and the second player is trying to convict him of a lie. The second method is based on boolean valuations. For t...
متن کاملCombinatorial Proof Semantics
The paper Proofs Without Syntax [Annals of Mathematics, to appear] introduced the notion of a combinatorial proof for classical propositional logic. The present paper uses combinatorial proofs to define a semantics for classical propositional sequent calculus, an inductive translation from sequent proofs to combinatorial proofs. The semantics is abstract and efficient: abstract in the sense tha...
متن کاملSome remarks on lengths of propositional proofs
We survey the best known lower bounds on symbols and lines in Frege and extended Frege proofs. We prove that in minimum length sequent calculus proofs, no formula is generated twice or used twice on any single branch of the proof. We prove that the number of distinct subformulas in a minimum length Frege proof is linearly bounded by the number of lines. Depth d Frege proofs of m lines can be tr...
متن کاملTowards Hilbert ’ s 24 th Problem : Combinatorial Proof Invariants
Proofs Without Syntax [37] introduced polynomial-time checkable combinatorial proofs for classical propositional logic. This sequel approaches Hilbert’s 24 Problem with combinatorial proofs as abstract invariants for sequent calculus proofs, analogous to homotopy groups as abstract invariants for topological spaces. The paper lifts a simple, strongly normalising cut elimination from combinatori...
متن کاملComputing Interpolants without Proofs
We describe an incremental algorithm for computing interpolants for a pair φA, φB of formulas in propositional logic. In contrast with the common approaches, our method does not require a proof of unsatisfiability of φA ∧ φB , and can be realized using any SAT solver as a black box. We achieve this by combining model enumeration with the ability to easily generate interpolants in the special ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994